Improved Hill Climbing and Simulated Annealing Algorithms for Size Optimization of Trusses
نویسنده
چکیده
Truss optimization problem has been vastly studied during the past 30 years and many different methods have been proposed for this problem. Even though most of these methods assume that the design variables are continuously valued, in reality, the design variables of optimization problems such as cross-sectional areas are discretely valued. In this paper, an improved hill climbing and an improved simulated annealing algorithm have been proposed to solve the truss optimization problem with discrete values for crosssectional areas. Obtained results have been compared to other methods in the literature and the comparison represents that the proposed methods can be used more efficiently than other proposed methods. Keywords—Size Optimization of Trusses, Hill Climbing, Simulated Annealing.
منابع مشابه
Theory of Evolutionary Algorithms and Application to System Synthesis
5 1 Overview of the Thesis 7 2 Global Optimization 11 2.1 The Global Optimization Problem . . . . . . . . . . . 12 2.2 Global Optimization Methods . . . . . . . . . . . . . . 14 2.3 Selected Optimization Methods . . . . . . . . . . . . . 17 2.3.1 Monte Carlo . . . . . . . . . . . . . . . . . . . 18 2.3.2 Hill Climbing . . . . . . . . . . . . . . . . . . . 19 2.3.3 Simulated Annealing . . . . . ...
متن کاملHill Climbing Algorithms and Trivium
This paper proposes a new method to solve certain classes of systems of multivariate equations over the binary field and its cryptanalytical applications. We show how heuristic optimization methods such as hill climbing algorithms can be relevant to solving systems of multivariate equations. A characteristic of equation systems that may be efficiently solvable by the means of such algorithms is...
متن کاملComparison of Heuristic Algorithms in Functions Optimization and Knapsack Problem
This paper addresses the comparison of heuristic algorithms in the case of real functions optimization and knapsack problem. Metaheuristics for algorithms hill climbing, simulated annealing, tabu search and genetic algorithm are shown, test results are presented and conclusions are drawn. Input parameters for optimization functions problem are optimised on a sample of functions. Also, algorithm...
متن کاملStochastic Local Search for Bayesian Networks
The paper evaluates empirically the suitability of Stochastic Local Search algorithms (SLS) for nding most probable explanations in Bayesian networks. SLS algorithms (e.g., GSAT, WSAT [16]) have recently proven to be highly e ective in solving complex constraint-satisfaction and satis ability problems which cannot be solved by traditional search schemes. Our experiments investigate the applicab...
متن کاملStructure and Properties of Leximin FCSP and its Influence on Optimisation Algorithms
In this paper we investigate why solving leximin fuzzy constraint satisfaction problems (FCSP) with non-enumerative algorithms, such as hill-climbing, simulated annealing and genetic algorithms, provide disappointing results. Specifically, we analyse the structure and properties of the leximin FCSPs and its influence on the search strategy of non-enumerative algorithms.
متن کامل